Elastic regularization in restricted Boltzmann machines: Dealing with $p\gg N$

Restricted Boltzmann machines (RBMs) are endowed with the universal power of modeling (binary) joint distributions. Meanwhile, as a result of their confining network structure, training RBMs confronts less difficulties (compared with more complicated models, e.g., Boltzmann machines) when dealing with approximation and inference issues. However, in certain computational biology scenarios, such as the cancer data analysis, employing RBMs to model data features may lose its efficacy due to the “p N” problem, in which the number of features/predictors is much larger than the sample size. The “p N” problem puts the bias-variance trade-off in a more crucial place when designing statistical learning methods. In this manuscript, we try to address this problem by proposing a novel RBM model, called elastic restricted Boltzmann machine (eRBM), which incorporates the elastic regularization term into the likelihood/cost function. We provide several theoretical analysis on the superiority of our model. Furthermore, attributed to the classic contrastive divergence (CD) algorithm, eRBMs can be trained efficiently. Our novel model is a promising method for future cancer data analysis. ∗ Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing 100084, China. E-mail: [email protected]. 1 ar X iv :1 51 0. 03 62 3v 1 [ cs .L G ] 1 3 O ct 2 01 5